Representation of permutations as products of two cycles
نویسندگان
چکیده
Given a permutation on n letters, we determine for which values of the integers l1 and l2 it is possible to represent as a product of two cycles of sizes l1 and l2, respectively. Our results are of a constructive nature. We also deal with the special cases l1 = l2 for even permutations and l1 = l2 + 1 for odd permutations, which were solved di5erently by Bertram in (J. Combin. Theory 12 (1972) 368). c © 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Separation Probabilities for Products of Permutations
We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements 1, 2, . . . , k are in distinct cycles of the random permutation of {1, 2, . . . , n} obtained as product of two uniformly random n-cycles.
متن کاملThe Distribution of the Size of the Union of Cycles for Two Types of Random Permutations
We discuss some problems and permutation statistics involving two different types of random permutations. Under the usual model of random permutations, we prove that the shifted coverage of the elements of {1, 2, . . . , k} of a random permutation over {1, 2, . . . , n}; that is, the size of the union of the cycles containing these elements, excluding these elements themselves, follows a negati...
متن کاملCounting Genus One Partitions and Permutations
We prove the conjecture by M. Yip stating that counting genus one partitions by the number of their elements and blocks yields, up to a shift of indices, the same array of numbers as counting genus one rooted hypermonopoles. Our proof involves representing each genus one permutation by a four-colored noncrossing partition. This representation may be selected in a unique way for permutations con...
متن کاملPermutations and Coin-Tossing Sequences
This quote is from Herbert Wilf's delightful book generatingfunctionology [1, p. 75]. It occurs in the chapter on the exponential formula, a powerful technique for counting labelled structures formed from "connected" components. Such structures include various types of graphs, permutations (formed from cycles), and partitions (a union of blocks). Applied to permutations on n letters comprising ...
متن کاملHow to count genus one partitions
We prove the conjecture by M. Yip stating that counting genus one partitions by the number of their elements and parts yields, up to a shift of indices, the same array of numbers as counting genus one rooted hypermonopoles. Our proof involves representing each genus one permutation by a four-colored noncrossing partition. This representation may be selected in a unique way for permutations cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 285 شماره
صفحات -
تاریخ انتشار 2004